TRANSFORMATIONS OF MATHEMATICAL AND STIMULUS FUNCTIONS
نویسندگان
چکیده
منابع مشابه
Transformations of mathematical and stimulus functions.
Following a pretest, 8 participants who were unfamiliar with algebraic and trigonometric functions received a brief presentation on the rectangular coordinate system. Next, they participated in a computer-interactive matching-to-sample procedure that trained formula-to-formula and formula-to-graph relations. Then, they were exposed to 40 novel formula-to-graph tests and 10 novel graph-to-formul...
متن کاملContinuity of super- and sub-additive transformations of continuous functions
We prove a continuity inheritance property for super- and sub-additive transformations of non-negative continuous multivariate functions defined on the domain of all non-negative points and vanishing at the origin. As a corollary of this result we obtain that super- and sub-additive transformations of continuous aggregation functions are again continuous aggregation functions.
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Super- and sub-additive transformations of aggregation functions from the point of view of approximation
The way super- and sub-additive transformations of aggregation functions are introduced involve suprema and infima taken over simplexes whose dimensions may grow arbitrarily. Exact values of such transformations may thus be hard to determine in general. In this note we discuss methods of algorithmic approximation of such transformations.
متن کاملAutomating Mathematical Program Transformations
Program transformations are often not automated because their definitions do not specify the many details needed to implement them correctly in code. We define two, the conversion of Boolean expressions into integer inequalities and the convex hull transformation of disjunctive constraints, using a novel style based on set theory. This treats constraints as syntactic objects, allowing mappings ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Behavior Analysis
سال: 2006
ISSN: 0021-8855,1938-3703
DOI: 10.1901/jaba.2006.139-05